package org.example.myleet.p646;

import org.example.myleet.Utils.Assert;
import org.example.myleet.Utils.Parser;

public class Main {
    public static void main(String[] args) {
        Solution solution = new Solution();
        Assert.isTrue(2 == solution.findLongestChain(Parser.parse("[[1,2], [2,3], [3,4]]")));
        Assert.isTrue(1 == solution.findLongestChain(Parser.parse("[[1,2]]")));
        Assert.isTrue(3 == solution.findLongestChain(Parser.parse("[[-6,9],[1,6],[8,10],[-1,4],[-6,-2],[-9,8],[-5,3],[0,3]]")));
    }
}
